A Lower Bound for Computing Lagrange's Real Root Bound
نویسندگان
چکیده
In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple O(n logn) algorithm described in Mehlhorn-Ray (2010) can be used to compute the bound. Our main result is that this is optimal in the real RAM model. Our paper explores the tradeoff between improving the quality of bounds on absolute positiveness and their computational complexity.
منابع مشابه
مدلی جدید برای حل مساله موازنه خط مونتاژ هزینهگرا
In this research, a new model for cost-oriented assembly line balancing problem has been presented that consists of labour and equipment cost. The approach of this model for these costs is coincided with real condition of assembly lines and yield possibility of using common equipment amoung tasks. The objective function and constrains of this model has been shown by mathematical relations and ...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملGeneralized Local Homology Modules of Complexes
The theory of local homology modules was initiated by Matlis in 1974. It is a dual version of the theory of local cohomology modules. Mohammadi and Divaani-Aazar (2012) studied the connection between local homology and Gorenstein flat modules by using Gorenstein flat resolutions. In this paper, we introduce generalized local homology modules for complexes and we give several ways for computing ...
متن کاملA new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کامل